Demonstrating Lambda Calculus Reduction
نویسنده
چکیده
We describe lambda calculus reduction strategies using big-step operational semantics and show how to efficiently trace such reductions. This is used in a web-based lambda calculus reducer, at http://www.dina.kvl.dk/~sestoft/lamreduce/.
منابع مشابه
Superdevelopments for Weak Reduction
We study superdevelopments in the weak lambda calculus of Çaǧman and Hindley, a confluent variant of the standard weak lambda calculus in which reduction below lambdas is forbidden. In contrast to developments, a superdevelopment from a term M allows not only residuals of redexes in M to be reduced but also some newly created ones. In the lambda calculus there are three ways new redexes may be ...
متن کاملApplications of Innitary Lambda Calculus
We present an introduction to in nitary lambda calculus, highlighting its main properties. Subsequently we give three applications of in nitary lambda calculus. The rst addresses the non-de nability of Surjective Pairing, which in Barendregt [1984] is shown to be not de nable in lambda calculus. We show how this result follows easily as an application of Berry's Sequentiality Theorem, which its...
متن کاملInvestigations on the Dual Calculus
The Dual Calculus, proposed recently by Wadler, is the outcome of two distinct lines of research in theoretical computer science: A. Efforts to extend the Curry-Howard isomorphism, established between the simply-typed lambda calculus and intuitionistic logic, to classical logic. B. Efforts to establish the tacit conjecture that call-by-value reduction in lambda calculus is dual to call-by-name ...
متن کاملThe lambda - context calculus ( extended version ) 1
We present the Lambda Context Calculus. This simple lambda-calculus features variables arranged in a hierarchy of strengths such that substitution of a strong variable does not avoid capture with respect to abstraction by a weaker variable. This allows the calculus to express both capture-avoiding and capturing substitution (instantiation). The reduction rules extend the ‘vanilla’ lambda-calcul...
متن کاملThe dagger lambda calculus
We present a novel lambda calculus that casts the categorical approach to the study of quantum protocols [4] into the rich and well established tradition of type theory. Our construction extends the linear typed lambda calculus [6] with a linear negation [1] of ”trivialised” De Morgan duality [5]. Reduction is realised through explicit substitution, based on a symmetric notion of binding of glo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001